﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace LeetCode
{
    public class Program
    {
        static void Main(string[] args)
        {
            var nums1 = new int[] { 1, 2, 3, 4 };
            ListNode head = new ListNode(nums1);


            var dataStructure = new simple.DataStructure();
            //var headResult = dataStructure.ReverseList(head);
            //var nums1 = new int[] { 1, 2, 2, 1 };
            //var nums2 = new int[] { 2, 2 };
            //var result = dataStructure.Intersect(nums1, nums2);
            //var prices = new int[] { 7, 2, 9, 11, 1, 3, 3, 6, 4 };
            //var result = dataStructure.MaxProfit(prices);
            var root = new TreeNode()
            {
                val = 5,
                left = new TreeNode()
                {
                    val = 4,
                    left = new TreeNode()
                    {
                        val = 11,
                        left = new TreeNode() { val = 7 },
                        right = new TreeNode() { val = 2 },
                    },
                },
                right = new TreeNode()
                {
                    val = 8,
                    left = new TreeNode() { val = 13 },
                    right = new TreeNode()
                    {
                        val = 4,
                        right = new TreeNode() { val = 1 }
                    },
                },

            };
            var rootReuslt = dataStructure.HasPathSum(root,22);
            //var s = "loveleetcode";
            //var result = dataStructure.FirstUniqChar(s);
            Console.ReadLine();

        }




    }
}
